Unit Commitment by Hybrid Ant System/Priority List Method based Probabilistic Approach
نویسندگان
چکیده
منابع مشابه
solution of security constrained unit commitment problem by a new multi-objective optimization method
چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...
Evolving ant colony optimization based unit commitment
Ant colony optimization (ACO) was inspired by the observation of natural behavior of real ants’ pheromone trail formation and foraging. Ant colony optimization ismore suitable for combinatorial optimization problems. ACO is successfully applied to the traveling salesman problem. Multistage decision making of ACO gives an edge over other conventional methods. This paper proposes evolving ant col...
متن کاملUnit Commitment by Evolving Ant Colony Optimization
Ant Colony Optimization is more suitable for combinatorial optimization problems. ACO is successfully applied to the traveling salesman problem, and multistage decision making of ACO has an edge over other conventional methods. In this paper, the authors propose the Evolving Ant Colony Optimization (EACO) method for solving unit commitment (UC) problem. The EACO employs Genetic Algorithm (GA) f...
متن کاملUnit Commitment With Probabilistic Reserve
This paper demonstrates how a probabilistic criterion based on the full capacity outage probability distribution (e.g., LOLP) could be integrated into the unit commitment (UC) optimization using simple statistical approximation. While this provides a direct and computationally cheaper means as compared to a recently published approach to locating the globally optimal SR allocation (and associat...
متن کاملSolving the Unit Commitment Problem by a Unit Decommitment Method
In this paper, we present a unified decommitment method to solve the unit commitment problem. This method starts with a solution having all available units online at all hours in the planning horizon and determines an optimal strategy for decommitting units one at a time. We show that the proposed method may be viewed as an approximate implementation of the Lagrangian relaxation approach and th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEJ Transactions on Power and Energy
سال: 2008
ISSN: 0385-4213,1348-8147
DOI: 10.1541/ieejpes.128.919